Atropos: A PSPACE-Complete Sperner Triangle Game

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Games on the Sperner Triangle

We create a new two-player game on the Sperner Triangle based on Sperner’s lemma. Our game has simple rules and several desirable properties. First, the game is always certain to have a winner. Second, like many other interesting games such as Hex and Geography, we prove that deciding whether one can win our game is a PSPACE-complete problem. Third, there is an elegant balance in the game such ...

متن کامل

A PSPACE-complete Graph Nim

We build off the game, NimG [7] to create a version named Neighboring Nim. By reducing from Geography, we show that this game is PSPACE-hard. The games created by the reduction share strong similarities with Undirected (Vertex) Geography and regular Nim, both of which are solvable in polynomial-time. We show how to construct PSPACE-complete versions with nim heaps ∗1 and ∗2. This application of...

متن کامل

Ladders Are PSPACE-Complete

In the game of Go, the question of whether a ladder—a method of capturing stones—works, is shown to be PSPACE-complete. Our reduction closely follows that of Lichtenstein and Sipser [LS80], who first showed PSPACE-hardness of Go by letting the outcome of a game depend on the capture of a large group of stones. We achieve greater simplicity by avoiding the need for pipes and crossovers.

متن کامل

Lemmings Is PSPACE-Complete

Lemmings is a computer puzzle game developed by DMA Design and published by Psygnosis in 1991, in which the player has to guide a tribe of lemming creatures to safety through a hazardous landscape, by assigning them specific skills that modify their behavior in different ways. In this paper we study the optimization problem of saving the highest number of lemmings in a given landscape with a gi...

متن کامل

Scrabble Is PSPACE-Complete

In this paper we study the computational complexity of the game of Scrabble. We prove the PSPACEcompleteness of a derandomized model of the game, answering an open question of Erik Demaine and Robert Hearn.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Internet Mathematics

سال: 2008

ISSN: 1542-7951,1944-9488

DOI: 10.1080/15427951.2008.10129176